No-dismissal speculation
Original Post
Since Mark's "Experimenting again" thread has stretched to two pages, it seems like time to start a new one, in this case focusing on our wild speculations as to what he means by there being no dismissal in the new system. A few guesses have been posited, and shot down already.
My first guess is that there is some sort of limit to the number of tasks or pages, beyond which the oldest undone task(s) must be crossed off and either reentered or deleted (forever). This would not be "dismissal" as Mark has defined it previously, where one would highlight the undone tasks on the page and then consider reentering them after a period of reflection. Of course, if one simply reenters everything, the number of tasks will not change, but presumably some of the old stuff would simply be deleted.
My second guess is similar but more radical: perhaps there is a rule that, after a certain number of page visits (N-1), every undone task must be done on the Nth visit to that page. This would be like the old C2 rule in SF. Of course, deciding not to do a task (i.e. delete it) is a valid action, so there is still an escape hatch here.
Please post your guesses, until Mark reveals the answer.
My first guess is that there is some sort of limit to the number of tasks or pages, beyond which the oldest undone task(s) must be crossed off and either reentered or deleted (forever). This would not be "dismissal" as Mark has defined it previously, where one would highlight the undone tasks on the page and then consider reentering them after a period of reflection. Of course, if one simply reenters everything, the number of tasks will not change, but presumably some of the old stuff would simply be deleted.
My second guess is similar but more radical: perhaps there is a rule that, after a certain number of page visits (N-1), every undone task must be done on the Nth visit to that page. This would be like the old C2 rule in SF. Of course, deciding not to do a task (i.e. delete it) is a valid action, so there is still an escape hatch here.
Please post your guesses, until Mark reveals the answer.
Reply by Mark Forster
Wild guesses will get you nowhere!
Reply by Alan Baljeu
Every time Mark invents a system, there's speculation about maybe this or that or the other innovation on previous systems. No one has ever successfully guessed, except for DWM where Mark left an abundance of clues on its workings. Then Mark reveals the system and it turns out to have a unique innovation not apparent in any previous systems.
Every time.
Every time.
Reply by Erik
Guessing is fun and entertaining :D
Reply by Rainer
I'd like to buy a vowel, please.
Reply by Christian G.
You better buy a towel! Mark will destroy the earth in order to make way for his new system ;-)
Reply by Bernie
<>
Don't panic!
Don't panic!
Reply by sabre23t
<< Don't panic! >>
I'm pressing the red button ...
http://davidseah.com/blog/2005/02/dont-panic/
http://www.bbc.co.uk/radio4/hitchhikers/game_nolan.shtml
;-}
Unfortunately it only gets me a hhguide.xml failed error
:-(
I'm pressing the red button ...
http://davidseah.com/blog/2005/02/dont-panic/
http://www.bbc.co.uk/radio4/hitchhikers/game_nolan.shtml
;-}
Unfortunately it only gets me a hhguide.xml failed error
:-(
Reply by Rainer
You make me feel like Ford Perfect!
:-)
:-)
Reply by Bernie
<>
Dang! Me too, even in Firefox.
Dang! Me too, even in Firefox.
Reply by Alan Baljeu
That would be par for the course with the Guide. Refer to the above advisory message. ;-)
Reply by sabre23t
... not dismissing this off topic tangent yet ;-) ...
Googling found me http://pot.home.xs4all.nl/infocom/hgg.html albeit lacking the promised full illustrations of the non-working flash version.
Googling found me http://pot.home.xs4all.nl/infocom/hgg.html albeit lacking the promised full illustrations of the non-working flash version.